A Simple Linearisation of the Self-shrinking Generator
نویسندگان
چکیده
Nowadays stream ciphers are the fastest among the encryption procedures, thus they are performed in many practical applications. Irregularly decimated generators are very simple sequence generators to be used as keystream generators in stream ciphers. In this paper, a linearisation method for the self-shrinking generator has been developed. The proposal defines linear structures based on cellular automata (rules 102 or 60) able to generate the self-shrunken sequence. The obtained cellular automata are simple, easy to be implemented and can be extended to other sequence generators in a range of cryptographic interest.
منابع مشابه
Characterization of the Least Periods of the Generalized Self-Shrinking Sequences
In 2004, Y. Hu and G. Xiao introduced the generalized self-shrinking generator, a simple bit-stream generator considered as a specialization of the shrinking generator as well as a generalization of the self-shrinking generator. The authors conjectured that the family of generalized self-shrinking sequences took their least periods in the set {1, 2, 2}, where L is the length of the Linear Feedb...
متن کاملSoftware Implementation of P−adic Self−shrinking Generator for Aerospace Cryptographic Systems
To be suitable for use in aerospace cryptographic systems software-oriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bits (SSPG-8) in one clock cycle, is proposed. The theoretical base of Self-Shrinking p-adic Generator is reca...
متن کاملCorrection to "Generalized Self-Shrinking Generator"
In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, “Generalized Self-Shrinking Generator,” IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.
متن کاملSecurity Analysis of the Generalized Self-shrinking Generator
In this paper, we analyze the generalized self-shrinking generator newly proposed in [8]. Some properties of this generator are described and an equivalent definition is derived, after which two attacks are developed to evaluate its security. The first attack is an improved clock-guessing attack using short keystream with the filter function (vector G) known. The complexity of this attack is O(...
متن کامل